Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Dit handboek vormt een inleiding tot de numerieke wiskunde voor bachelorstudenten. Aan de hand van eenvoudige numerieke problemen worden belangrijke begrippen en denkpatronen bijgebracht: conditie, stabiliteit, foutenanalyse, efficiëntie, complexiteit, enz. Er wordt verondersteld dat de student vertrouwd is met calculus en lineaire algebra, en noties heeft van programmeren.De volgende onderwerpen komen aan bod: foutenanalyse, stelsels lineaire vergelijkingen, veelterminterpolatie, numerieke differentiatie en integratie, differentiaalvergelijkingen, iteratieve methodes voor niet-lineaire vergelijkingen, stelsels lineaire en niet-lineaire vergelijkingen, veeltermvergelijkingen, eigenwaarden, en optimalisatie in één en meerdere variabelen.De aanpak is gericht op toepassingen maar welke toepassingen het best aan bod komen, hangt van de studentenpopulatie af. De elementaire technieken kunnen gemakkelijk gebruikt worden als bouwstenen in een groter probleem uit een bepaalde toepassingsdiscipline. €2600 €2213als Acco aandeelhouder in winkelmandje Leveren binnen België: 1 à 3 werkdagen Docentexemplaar aanvragen Persexemplaar aanvragen EXTRA'S BIJ DEZE PUBLICATIE Downloads ProductDetails Uitgeverij: ACCO Uitgeverij Publicatiedatum: 13 september 2006 Boek - Softcover Pagina's: 360 ISBN: 9789033462535 Vakdomeinen Wiskunde en statistiek Prijs disclaimer Wat maakt dit boek zo bijzonder?

Numerical analysis --- numerieke analyse --- Stochastic processes --- Mathematical statistics --- Operational research. Game theory --- Numerieke wiskunde --- Foutenanalyse --- Integratie --- Lineaire vergelijking --- Veelterminterpolatie --- fouten-analyse --- numerieke wiskunde --- (zie ook: fmea) --- Numerieke wiskunde. --- Academic collection --- 519.6 --- Differentiaalrekenen --- foutenanalyse --- lineaire vergelijking --- veelterminterpolatie --- differentiaalvergelijkingen --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Evolving from an elementary discussion, this book develops the Euclidean algorithm to a very powerful tool to deal with general continued fractions, non-normal Padé tables, look-ahead algorithms for Hankel and Toeplitz matrices, and for Krylov subspace methods. It introduces the basics of fast algorithms for structured problems and shows how they deal with singular situations. Links are made with more applied subjects such as linear system theory and signal processing, and with more advanced topics and recent results such as general bi-orthogonal polynomials, minimal Padé approximation, poly

Ordered algebraic structures --- Numerical approximation theory --- Computer science --- lineaire algebra --- Algebras, Linear --- Euclidean algorithm --- Orthogonal polynomials --- Padé approximant --- #TELE:SISTA --- 519.6 --- 681.3*G11 --- 681.3*G12 --- 681.3*G13 --- Algorithm of Euclid --- Continued division --- Division, Continued --- Euclid algorithm --- Euclidian algorithm --- Euclid's algorithm --- Algorithms --- Number theory --- Linear algebra --- Algebra, Universal --- Generalized spaces --- Mathematical analysis --- Calculus of operations --- Line geometry --- Topology --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 681.3*G12 Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 681.3*G11 Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- Fourier analysis --- Functions, Orthogonal --- Polynomials --- Approximant, Padé --- Approximation theory --- Continued fractions --- Power series --- Euclidean algorithm. --- Algebras, Linear. --- Padé approximant. --- Orthogonal polynomials. --- Padé approximant. --- Pade approximant.